Feedback-optimized parallel tempering Monte Carlo
نویسندگان
چکیده
We introduce an algorithm for systematically improving the efficiency of parallel tempering Monte Carlo simulations by optimizing the simulated temperature set. Our approach is closely related to a recently introduced adaptive algorithm that optimizes the simulated statistical ensemble in generalized broad-histogram Monte Carlo simulations. Conventionally, a temperature set is chosen in such a way that the acceptance rates for replica swaps between adjacent temperatures are independent of the temperature and large enough to ensure frequent swaps. In this paper, we show that by choosing the temperatures with a modified version of the optimized ensemble feedback method we can minimize the round-trip times between the lowest and highest temperatures which effectively increases the efficiency of the parallel tempering algorithm. In particular, the density of temperatures in the optimized temperature set increases at the ‘bottlenecks’ of the simulation, such as phase transitions. In turn, the acceptance rates are now temperature dependent in the optimized temperature ensemble. We illustrate the feedback-optimized parallel tempering algorithm by studying the two-dimensional Ising ferromagnet and the two-dimensional fully frustrated Ising model, and briefly discuss possible feedback schemes for systems that require configurational averages, such as spin glasses.
منابع مشابه
Parallel-Tempering Monte-Carlo Simulation with Feedback-Optimized Algorithm Applied to a Coil-to-Globule Transition of a Lattice Homopolymer
We present a study of the parallel tempering (replica exchange) Monte Carlo method, with special focus on the feedbackoptimized parallel tempering algorithm, used for generating an optimal set of simulation temperatures. This method is applied to a lattice simulation of a homopolymer chain undergoing a coil-to-globule transition upon cooling. We select the optimal number of replicas for differe...
متن کاملOptimized Monte Carlo Methods
I discuss optimized data analysis and Monte Carlo methods. Reweighting methods are discussed through examples, like Lee-Yang zeroes in the Ising model and the absence of deconfinement in QCD. I discuss reweighted data analysis and multi-hystogramming. I introduce Simulated Tempering, and as an example its application to the Random Field Ising Model. I illustrate Parallel Tempering, and discuss ...
متن کاملMonte Carlo Methods for Rough Free Energy Landscapes: Population Annealing and Parallel Tempering
Parallel tempering and population annealing are both effective methods for simulating equilibrium systems with rough free energy landscapes. Parallel tempering, also known as replica exchange Monte Carlo, is a Markov chain Monte Carlo method while population annealing is a sequential Monte Carlo method. Both methods overcome the exponential slowing associated with high free energy barriers. The...
متن کاملDetermination of normalizing constants for simulated tempering
In this paper, we propose to estimate the normalizing constants for simulated tempering by a modified histogram algorithm, the so-called contour Monte Carlo algorithm, and compare the efficiency of simulated tempering and parallel tempering. Our analysis reveals that simulated tempering tends to mix faster than parallel tempering at low temperature levels for simulating from complex systems. Th...
متن کاملar X iv : h ep - l at / 9 80 80 52 v 1 2 8 A ug 1 99 8 Results From The UKQCD Parallel Tempering Project
We present results from our study of the Parallel Tempering algorithm. We examine the swapping acceptance rate of a twin subensemble PT system. We use action matching technology in an attempt to maximise the swap acceptance rate. We model the autocorrelation times within Parallel Tempering ensembles in terms of autocorrelation times from Hybrid Monte Carlo. We present estimates for the autocorr...
متن کامل